Number of Variables and Expressive Power of First-Order Logic on Finite Ordered Structures
نویسنده
چکیده
منابع مشابه
Embedded Finite Models, Stability Theory and the Impact of Order
We extend bounds on the expressive power of firstorder logic over finite structures and over ordered finite structures, by generalizing to the situation where the finite structures are embedded in an infinite structure M , where M satisfies some simple combinatorial properties studied in model-theoretic stability theory. We first consider first-order logic over finite structures embedded in a s...
متن کاملFirst-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has been established that either way of settling this conjecture would resolve open problems in complexity theory. In fact, this holds true even for the particular instance of the ordered conjecture on the class of BIT-stru...
متن کاملFinite variable logics in descriptive complexity theory
Throughout the development of finite model theory, the fragments of first-order logic with only finitely many variables have played a central role. This survey gives an introduction to the theory of finite variable logics and reports on recent progress in the area. For each k 1 we let Lk be the fragment of first-order logic consisting of all formulas with at most k (free or bound) variables. Th...
متن کاملFixpoint Logic vs. Infinitary Logic in Finite-Model Theory
In recent years several extensions of first-order logic have been investigated in the context of finite-model theory. Fixpoint logic and the infinitary logic L∞ω with a finite number of variables have turned out to be of particular importance. The study of fixpoint logic generated interactions with both database theory and complexity theory, while the infinitary logic L∞ω proved to be a useful ...
متن کاملProperties of Binary Transitive Closure Logic over Trees
Binary transitive closure logic (FO∗ for short) is the extension of first-order predicate logic by a transitive closure operator of binary relations. It is known that this logic is more powerful than FO on arbitrary structures and on finite ordered trees. It is also known that it is at most as powerful as monadic second-order logic (MSO) on arbitrary structures and on finite trees. We will stud...
متن کامل